Limits on Quantum Adiabatic Optimization Warning: Rough Manuscript!

نویسنده

  • UMESH VAZIRANI
چکیده

• A quantum state Ψ is a linear superposition of basis states {|x〉}x and is described by the summation |Ψ〉 = ∑ x αx|x〉, with amplitudes αx ∈ C and |αx| the probability of observing the state x. • Formally, for an N dimensional system, the quantum state is represented by a "2 normalized vector in the N dimensional Hilbert with complex amplitudes. • Throughout this article we assume that our quantum system is finite dimensional (the dimension is typically denoted by N). • A change of the state Ψ is represented by a rotation of the vector |Ψ〉 in the Hilbert space. • How the state changes is determined by the Hamiltonian H , which describes the forces that act on the state Ψ. • The Hamiltonian, which can be time dependendent, acts as a linear operator on the state vector, and hence is described by a matrix ∈ CN×N . The time evolution is expressed by Schrödinger’s differential equation:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limits on Quantum Adiabatic Optimization Warning: Rough Manuscript! Wim Van Dam and Umesh Vazirani

x αx|x〉, with amplitudes αx ∈ C and |α x| the probability of observing the state x. • Formally, for an N dimensional system, the quantum state is represented by a l2 normalized vector in the N dimensional Hilbert with complex amplitudes. • Throughout this article we assume that our quantum system is finite dimensional (the dimension is typically denoted by N). • A change of the state Ψ is repre...

متن کامل

Experiences with Scheduling Problems on Adiabatic Quantum Computers

The realization of quantum computing models is nowadays a grand challenge regarding supercomputer architectures which may potentially exceed the scaling limits of Moore’s Law. The Canadian company D-Wave Systems Inc. developed a hardware for quantum annealing which is well suited for solving combinatorial optimization problems. We investigate the formulation of a scheduling problem for quantum ...

متن کامل

Approximability of Optimization Problems through Adiabatic Quantum Computation

Read more and get great! That's what the book enPDFd approximability of optimization problems through adiabatic quantum computation synthesis lectures on quantum computing will give for every reader to read this book. This is an on-line book provided in this website. Even this book becomes a choice of someone to read, many in the world also loves it so much. As what we talk, when you read more ...

متن کامل

Investigating the Performance of an Adiabatic Quantum Optimization Processor

We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary variables. To do so, we ran high performance Quantum Monte Carlo simulations on a large-scale Internet-based computing platform. We compare the median adiabatic times with the median running times of two classical sol...

متن کامل

Multiobjective Optimization in a Quantum Adiabatic Computer

In this work we present a quantum algorithm for multiobjective combinatorial optimization. We show that the adiabatic algorithm of Farhi et al. [arXiv:quant-ph/0001106] can be used by mapping a multiobjective combinatorial optimization problem onto a Hamiltonian using a convex combination among objectives. We present mathematical properties of the eigenspectrum of the associated Hamiltonian and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009